A Preferred First-order Answer Set Programs
نویسندگان
چکیده
In this paper, we consider the issue of how first-order answer set programs can be extended for handling preference reasoning. To this end, we propose a progression-based preference semantics for first-order answer set programs while explicit preference relations are presented. We study essential properties of the proposed preferred answer set semantics. To understand the expressiveness of preferred first-order answer set programming, we further specify a second-order logic representation which precisely characterizes the progression-based preference semantics.
منابع مشابه
0pt Preferred Answer Sets for Extended Logic Programs
In this paper, we extend Gelfond and Lifschitz’s answer set semantics to prioritized extended logic programs. In such programs, an ordering on the program rules is used to express preferences. We show how this ordering can be used to define preferred answer sets and thus to increase the set of consequences of a program. We define a strong and a weak notion of preferred answer sets. The first ta...
متن کاملPreferred Answer Sets for Extended Logic Programs
In this paper, we extend Gelfond and Lifschitz’s answer set semantics to prioritized extended logic programs. In such programs, an ordering on the program rules is used to express preferences. We show how this ordering can be used to define preferred answer sets and thus to increase the set of consequences of a program. We define a strong and a weak notion of preferred answer sets. The first ta...
متن کاملTranslating Preferred Answer Set Programs to Propositional Logic
We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and practical interests: on one hand, it will shed new insights to understand the expressive power of preferred answer set programs; on the other hand, it may also lead to efficient implementations for computing preferred answer sets of...
متن کاملPreferred Answer Sets for Ordered Logic Programs
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a “best” answer set. Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a preference for satisfying certain rules, possibly at the cost of violating less important ones. We show that such a rule order induces a natural order on exte...
متن کاملA Game-theoretic Characterization on the First-order Indefinability of Answer Set Programs
Under the general theory of stable models [17, 24], a first-order answer set program is semantically equivalent to a second-order sentence. Then a first-order answer set program is called first-order definable on finite structures if the set of finite answer sets of the program can be captured by a first-order sentence. First-order definability is a desirable property which provides alternative...
متن کامل